/*
https://leetcode.cn/problems/count-pairs-that-form-a-complete-day-i/description/
3184. 构成整天的下标对数目 I
*/

class Solution:
    def countCompleteDayPairs(self, hours: List[int]) -> int:
        ans=0
        for i in range(len(hours)):
            for j in range(i+1,len(hours)):
                if (hours[i]+hours[j])%24==0:
                    print(hours[i],hours[j])
                    ans+=1
        return ans
